翻訳と辞書 Words near each other ・ Dee Mosbacher ・ Dee Murray ・ Dee Nasty ・ Dedringer ・ Dedrique Taylor ・ Dedryck Boyata ・ Dedu ・ Dedua language ・ Deduce, You Say! ・ Deductible ・ Deduction ・ Deduction and induction ・ Deduction board game ・ Deduction theorem ・ Deductive classifier ・ Deductive closure ・ Deductive database ・ Deductive fallacy ・ Deductive lambda calculus ・ Deductive language ・ Deductive mood ・ Deductive pragmatism ・ Deductive reasoning ・ Deductive-nomological model ・ Dedulești ・ Dedumose I ・ Dedumose II ・ Dedun ・ Dedunu Silva ・ Dedunupitiya Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Deductive closure ： ウィキペディア英語版 Deductive closure Deductive closure is a property of a set of objects (usually the objects in question are statements). A set of objects, O, is said to exhibit ''closure'' or to be ''closed'' under a given operation, R, provided that for every object, x, if x is a member of O and x is R-related to any object, y, then y is a member of O.〔Peter D. Klein, ''Closure'', ''The Cambridge Dictionary of Philosophy (second edition)〕 In the context of statements, a deductive closure is the set of all the statements that can be deduced from a given set of statements. In propositional logic, the set of all true propositions exhibits deductive closure: if set O is the set of true propositions, and operation R is logical consequence (“$\backslash vdash$”), then provided that proposition p is a member of O and p is R-related to q (i.e., p $\backslash vdash$ q), q is also a member of O. == Epistemic closure == (詳細はepistemology, many philosophers have and continue to debate whether particular subsets of propositions—especially ones ascribing knowledge or justification of a belief to a subject—are closed under deduction. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Deductive closure」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.